package pat;

import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
import java.util.Vector;

public class findcoins {

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int flag = 0;
		Vector<Integer> v = new Vector<Integer>();
		int n = s.nextInt();
		int m = s.nextInt();
		int a[] = new int[n];

		for (int i = 0; i < n; i++) {
			a[i] = s.nextInt();
		}
		Arrays.sort(a);
		
		for (int i = 0; i < a.length; i++) {
			for (int j = i + 1; j < a.length; j++) {
				if ((a[i] + a[j] == m)) {
					v.add(a[i]);
					flag = 1;
				}
			}
		}
		if (flag == 1) {
			Collections.sort(v);
			System.out.print(v.get(0) + " " + (m - v.get(0)));
		}

		if (flag == 0) {
			System.out.print("No Solution");
		}
	}
}
